Tables of linear congruential generators of different sizes and good lattice structure
نویسنده
چکیده
We provide sets of parameters for multiplicative linear congruential generators (MLCGs) of different sizes and good performance with respect to the spectral test. For ` = 8, 9, . . . , 64, 127, 128, we take as a modulus m the largest prime smaller than 2`, and provide a list of multipliers a such that the MLCG with modulus m and multiplier a has a good lattice structure in dimensions 2 to 32. We provide similar lists for power-of-two moduli m = 2`, for multiplicative and non-multiplicative LCGs.
منابع مشابه
Structural Properties for Two Classes of Combined Random Number Generators
We analyze a class of combined random number generators recently proposed by L'Ecuyer, which combines a set of linear congruential generators (LCG's) with distinct prime moduli. We show that the geometrical behavior of the vectors of points produced by the combined generator can be approximated by the lattice structure of an associated LCG, whose modulus is the product of the moduli of the indi...
متن کاملBad Lattice Structures for Vectors of Nonsuccessive Values Produced by Some Linear Recurrences
Usually, the t-dimensional spectral test for linear congruential generators examines the lattice structure of all the points formed by taking t successive values in the sequence. In this paper, we consider the case where the t values taken are not successive, but separated by lags that are chosen a priori. For certain classes of linear congruential and multiple recursive generators, and for cer...
متن کاملInversive Congruential Pseudorandom Numbers Avoid the Planes
Nonlinear congruential pseudorandom number generators based on inversions have recently been introduced and analyzed. These generators do not show the lattice structure of the widely used linear congruential method. In the present paper it is proved that the points formed by d consecutive pseudorandom numbers of an inversive congruential generator with prime modulus possess an even stronger pro...
متن کاملQuasi-Monte Carlo Node Sets from Linear Congruential Generators
In this paper we present a new approach to nding good lattice points. We employ the spectral test, a well-known gure of merit for uniform random number generators. This concept leads to an assessment of lattice points g that is closely related to the classical Babenko-Zaremba quantity (g; N). The associated lattice rules are good uniformly over a whole range of dimensions. Our numerical example...
متن کاملOn the Digit Test
In a set of stochastic simulations, which we collectively call the digit test, we compare the widely used linear congruential with the new inversive random number generators. The inversive generators are found to perform always at least as good as any of the linear congruential generators; in some simulation runs, they perform signiicantly better.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Math. Comput.
دوره 68 شماره
صفحات -
تاریخ انتشار 1999